The construction of double-ended classical trajectories

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Construction of Double-Ended Classical Trajectories

In the present paper we describe relaxation methods for constructing doubleended classical trajectories. We illustrate our approach with an application to a model anharmonic system, the Henon-Heiles problem. Trajectories for this model exhibit a number of interesting energy-time relationships that appear to be of general use in characterizing the dynamics. Typeset using REVTEX Present address: ...

متن کامل

construction and validation of the translation teacher competency test and the scale of students’ perceptions of translation teachers

the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...

The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues

A priority queue is a data type where the element with the smallest key value can be found and deleted, and new elements can be inserted. It is also called a priority queue when the element with the largest key value is wanted, instead of the smallest. In some cases, it is interesting to find and delete both the smallest and the largest element, as well as to be able to insert new elements. A s...

متن کامل

An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues

Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemical Physics Letters

سال: 1994

ISSN: 0009-2614

DOI: 10.1016/0009-2614(94)01058-7